import java.util.Scanner;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 周斌
 * Date: 2023-11-01
 * Time: 8:16
 */
public class Test {
    /*//求斐波那契数列的第n项。(迭代实现)
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int sum = fibonacci(n);
        System.out.println(sum);
    }
    public static int fibonacci(int x) {
        int n1 = 1;
        int n2 = 1;
        int sum = 0;
        for (int i = 3; i <=x ; i++) {
            sum= n1+n2;
            n1 = n2;
            n2 = sum;
        }
        return sum;
    }*/
}
